Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
نویسندگان
چکیده
منابع مشابه
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
For the λ -calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of ‘future’ (also: virtual) redexes. In the implementation of functional programming languages it is common practice to perform β -reductions at compile time whenever possible in order to produce code that requires fewer reductions at run-time. This is, however, in principle limited ...
متن کاملExpressibility in the Lambda Calculus with Letrec
Rewriting Systems. An abstract rewriting system (ARS) is a quadruple ⟨A,Φ, src, tgt⟩ consisting of a set A of objects, a set Φ of steps, and src, tgt ∶ Φ → A, the source and target functions. We will always assume that A ∩Φ = ∅. For objects a ∈ A we denote by Φout(a) and by Φin(a) the set of steps in Φ that depart (are outgoing steps) Clemens Grabmayer and Jan Rochel 4 from a, and that arrive (...
متن کاملSimulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec. Bisimilarity simplifies equivalence proofs in the calculus and opens a way for more convenient correctness proofs for program transformations. Although this property may be a natural one...
متن کاملA Lambda-Calculus with letrec, case, constructors and non-determinism
A non-deterministic call-by-need lambda-calculus λndlr with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost reduction. The semantics is defined by contextual equivalence of expressions instead of using αβ(η)-equivalence. It is shown that several program transformati...
متن کاملUnfolding Semantics of the Untyped {\lambda}-Calculus with letrec
In this thesis we investigate the relationship between finite terms in λletrec, the λ-calculus with letrec, and the infinite λ-terms they express. We say that a λletrec-term expresses a λ-term if the latter can be obtained as an infinite unfolding of the former. Unfolding is the process of substituting occurrences of function variables by the right-hand side of their definition. We consider the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.48.9